PBANT-Optimized ANT Colony Routing Algorithm For ManetsPBANT-Optimized ANT Colony Routing Algorithm For Manets

The biggest challenge in MANETs is to find a path between the communication end points, which is aggravated through the node mobility in a limited resource scenario.AntColony-Based Routing Algorithm (ARA) is an on-demand routing algorithm for mobile, multi-hop ad-hoc networks that uses swarm intelligence paradigm and ant colony based meta heuristic. These approaches try to map the solution capability of swarms to mathematical and engineering problems. ARA can find routing paths that are close to the shortest paths even if the nodes in the networks have different transmission ranges. But the computation overhead and delay in establishing a path from source to destination is high. In this paper the PBANT algorithm proposed optimizes the route discovery process by considering the position of the nodes. The position details of the nodes (position of the source node, its neighbors and the position of the destination) can be obtained by positioning instruments such as GPS receiver. PBANT is basically ARA where position details of the nodes are known apriori. In this study, the performance of PBANT has been evaluated in terms of delivery rate, delay and control traffic, for different values of the algorithm parameters.